package leetcode.editor.cn;
//给定三个字符串 s1, s2, s3, 验证 s3 是否是由 s1 和 s2 交错组成的。 
//
// 
//
// 示例 1： 
//
// 输入：s1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
//输出：true
// 
//
// 示例 2： 
//
// 输入：s1 = "aabcc", s2 = "dbbca", s3 = "aadbbbaccc"
//输出：false 
// Related Topics 字符串 动态规划 
// 👍 345 👎 0

import java.util.List;

//Java：交错字符串
class P97InterleavingString {
    public static void main(String[] args) {
        Solution solution = new P97InterleavingString().new Solution();
        // TO TEST
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public boolean isInterleave(String s1, String s2, String s3) {
            Boolean result = null;

            return result;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}